Geometric Optimization of Thermo-Electric Coolers Using Hybrid Simulated Annealing Evolutionary Algorithm

نویسندگان

  • Doan V. K. Khanh
  • Pandian M. Vasant
  • Irraivan Elamvazuthi
  • Vo N. Dieu
چکیده

Thermo-electric Coolers nowadays are applied in a wide range of thermal energy systems. Over the past decades, many researches were employed to improve the efficiency of TECs by enhancing the material parameters and design parameters. The material parameters are the most significant, but they are restricted by currently available materials and module fabricating technologies. Therefore, the main objective of TECs design is to determine a set of design parameters such as leg area, leg length and the number of legs. In this paper, a new method of optimizing the dimension of TECs using hybrid simulated annealing genetic algorithm to maximize the rate of refrigeration was proposed. Equality constraint and inequality constraint were taken into consideration. The results of optimization obtained by using Hybrid Simulated Annealing Genetic Algorithm are validated by comparing with those obtained by simulated annealing and Cheng’s work using genetic algorithm. This work revealed that Hybrid Simulated Annealing Genetic Algorithm is more robust and more reliable than genetic algorithm and simulated annealing. 

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS

Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...

متن کامل

Distribution Network Expansion Using Hybrid SA/TS Algorithm

Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...

متن کامل

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

متن کامل

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems

In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016